Monte Carlo Variance of Scrambled Net Quadrature
نویسنده
چکیده
Hybrids of equidistribution and Monte Carlo methods of integration can achieve the superior accuracy of the former while allowing the simple error estimation methods of the latter. This paper studies the variance of one such hybrid, scrambled nets, by applying a multidimensional multiresolution (wavelet) analysis to the integrand. The integrand is assumed to be measurable and square integrable but not necessarily of bounded variation. In simple Monte Carlo, every nonconstant term of the multiresolution contributes to the variance of the estimated integral. For scrambled nets, certain low-dimensional and coarse terms do not contribute to the variance. For any integrand in L2, the sampling variance tends to zero faster under scrambled net quadrature than under Monte Carlo sampling, as the number of function evaluations n tends to infinity. Some finite n results bound the variance under scrambled net quadrature by a small constant multiple of the Monte Carlo variance, uniformly over all integrands f . Latin hypercube sampling is a special case of scrambled net quadrature.
منابع مشابه
Scrambled geometric net integration over general product spaces
Quasi-Monte Carlo (QMC) sampling has been developed for integration over [0, 1] where it has superior accuracy to Monte Carlo (MC) for integrands of bounded variation. Scrambled net quadrature gives allows replication based error estimation for QMC with at least the same accuracy and for smooth enough integrands even better accuracy than plain QMC. Integration over triangles, spheres, disks and...
متن کاملIntegration of Multivariate Haar Wavelet Series
This article considers the error of integrating multivariate Haar wavelet series by quasi-Monte Carlo rules using scrambled digital nets. Both the worst-case and random-case errors are analyzed. It is shown that scrambled net quadrature has optimal order. Moreover, there is a simple formula for the worst-case error.
متن کاملStrong tractability of integration using scrambled Niederreiter points
We study the randomized worst-case error and the randomized error of scrambled quasi–Monte Carlo (QMC) quadrature as proposed by Owen. The function spaces considered in this article are the weighted Hilbert spaces generated by Haar-like wavelets and the weighted Sobolev-Hilbert spaces. Conditions are found under which multivariate integration is strongly tractable in the randomized worst-case s...
متن کاملThe Discrepancy of Digital Nets
Digital sequences and nets are among the most popular kinds of low discrepancy sequences and are often used for quasi-Monte Carlo quadrature rules. Several years ago Owen proposed a method of scrambling digital sequences and recently Faure and Tezuka have proposed another method. This article considers the discrepancy of digital nets under these scramblings. The first main result of this articl...
متن کاملVariance of Quadrature over Scrambled Unions of Nets
This article studies the variance of quadrature over a scrambled union of two nets, (0 ; 0; m; s)-net and (1 ; 0; m?d; s)-net in base b. For every integrand in L 2 0; 1) s , a variance formula is given. Under some mild conditions on integrand, the rates of convergence are found. For smooth integrands, if d=m ! c with c < 1 and d ? cm is bounded as m ! 1, then the variance is of order n ?3+c (lo...
متن کامل